Approximation theory

Results: 831



#Item
261NP-complete problems / Spanning tree / Steiner tree problem / Minimum spanning tree / Time complexity / Approximation algorithm / Rectilinear Steiner tree / Theoretical computer science / Graph theory / Computational complexity theory

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:29:26
262Complexity classes / Structural complexity theory / Mathematical optimization / Approximation algorithms / Ε-net / NP / Polynomial-time approximation scheme / Reduction / Packing problem / Theoretical computer science / Computational complexity theory / Applied mathematics

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
263Measure theory / Diophantine approximation / Liouville number / Measure / Meagre set / Transcendence theory / Transcendental number / Sigma-algebra / Σ-finite measure / Mathematics / Mathematical analysis / Descriptive set theory

Estimating a product of sines using Diophantine approximation Jordan Bell Department of Mathematics, University of Toronto April 3, 2014

Add to Reading List

Source URL: individual.utoronto.ca

Language: English - Date: 2014-04-03 12:18:40
264Operations research / Spanning tree / Complexity classes / NP-complete problems / Minimum spanning tree / Steiner tree problem / R-tree / Approximation algorithm / Facility location / Theoretical computer science / Computational complexity theory / Applied mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:25:19
265Algebra / Deduction / Differential topology / Proof theory / Abstract algebra / Ring theory / Semiring

2-or-more approximation for intuitionistic logic Gabriel Scherer November 25, 2014 1

Add to Reading List

Source URL: gallium.inria.fr

Language: English - Date: 2014-11-25 09:35:48
266Operations research / Computational complexity theory / Convex optimization / Linear programming / Approximation algorithm / Algorithm / Lattice / Mathematics / Theoretical computer science / Applied mathematics

IEEE TRANSACTIONS ON ROBOTICS, VOL. 23, NO. 5, OCTOBERApproximate Algorithms for a Collaboratively Controlled Robotic Camera

Add to Reading List

Source URL: www.ieor.berkeley.edu

Language: English - Date: 2007-10-15 15:12:36
267Operations research / Complexity classes / NP-complete problems / Approximation algorithm / Optimization problem / Reduction / NP / Knapsack problem / Dynamic programming / Theoretical computer science / Applied mathematics / Computational complexity theory

A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-02-29 12:43:33
268Supply chain management / Marketing / Computational complexity theory / Approximation algorithm / Inventory / Systems engineering / Business / Technology / Operations research

Join seminar The Hong Kong University of Science and Technology Approximation Algorithms for Perishable Inventory Systems Dr. Xiting Gong

Add to Reading List

Source URL: www.bm.ust.hk

Language: English - Date: 2014-03-13 04:17:53
269Approximation algorithms / Complexity classes / Polynomial-time approximation scheme / Optimization problem / APX / Parameterized complexity / Bin packing problem / PTAS reduction / Theoretical computer science / Applied mathematics / Computational complexity theory

Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints∗ Ariel Kulik† Hadas Shachnai‡

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2011-10-04 12:29:59
270Operations research / Approximation algorithm / Computational complexity theory / Travelling salesman problem / Algorithm / XTR / Theoretical computer science / Mathematics / Applied mathematics

Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2014-07-16 20:39:51
UPDATE